c# Programming Glossary: n^2

http://stackoverflow.com/questions/10757019/entity-framework-initialization-is-slow-what-can-i-do-to-bootstrap-it-faster

is the one that needs some work. It's using an O n^2 algorithm when it probably doesn't have to but I haven't looked..

http://stackoverflow.com/questions/1101841/linq-how-to-perform-max-on-a-property-of-all-objects-in-a-collection-and-ret

finds the maximum value on every iteration making it O n^2 The ordering solution is O n log n Taking the Max value and..

http://stackoverflow.com/questions/11092930/check-if-listt-contains-any-of-another-list

which internally uses a HashSet T so instead of O n^2 for the first approach the equivalent of two nested loops you..

http://stackoverflow.com/questions/1116720/how-to-read-a-singly-linked-list-backwards

then pop everything off yielding the results. To use O n^2 performance but O 1 extra memory read it forwards each time..

http://stackoverflow.com/questions/2677000/how-to-find-the-longest-palindrome-in-a-given-string

palindrome in a given string I know how to do this in O n^2 . But it seems like there exist a better solution. I've found..

http://stackoverflow.com/questions/7237907/1d-fast-convolution-without-fft

http://stackoverflow.com/questions/8260555/how-to-find-the-mode-in-array-c

way to solve this problem. It will have a run time of O n^2 much worse than the optimal O n . You can do it with LINQ by..